Point Counting on Genus 3 Non Hyperelliptic Curves

نویسنده

  • Christophe Ritzenthaler
چکیده

We propose an algorithm to compute the Frobenius polynomial of an ordinary non hyperelliptic curve of genus 3 over F2N . The method is a generalization of Mestre’s AGM-algorithm for hyperelliptic curves and leads to a quasi quadratic time algorithm for point counting. The current methods for point counting on curves over finite fields of small characteristic rely essentially on a p-adic approach. They split up in three classes : those based on cohomology (Kedlaya), those based on deformation theory (Lauder) and those based on the canonical lift, proposed initially by Satoh. The AGM-algorithm developed by Mestre [?] for elliptic curves belongs to this last category. It is an elegant and natural variant in characteristic 2 of Satoh’s one using, in analogy with the complex field, the machinery of theta functions. Mestre generalized it later to the hyperelliptic case and Lercier-Lubicz’s implementations of these algorithms are the current records for point counting in characteristic 2 [?]. In this paper, we propose a generalization of the AGM-algorithm to the genus 3 non hyperelliptic case, as described in the author’s PhD thesis [?]. Fast algorithms for point counting on non hyperelliptic curves exist in the literature. However, as far as we know, the present one is the first which is fast enough for problems of cryptographic size in characteristic 2. The aim of the paper is to give all the details for an implementation. With this end in view, we shall give an algorithm based on Weber’s work for the computation of the initial theta constants. This computation, which is fairly easy for hyperelliptic curves, requires some work for this case. The other issue is to find a good lift in order that the computations take place in the field of definition of the lift. It is the main achievement of this paper that it shows how find good lifts. Once this is achieved, we are able to use the optimized iteration process of [?]. We shall illustrate the method with an example over F2100 . ? C. Ritzenthaler acknowledges the financial support provided through the European Community’s Human Potential Programme under contract HPRN-CT-2000-00114, GTEM

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fields of definition of torsion points on the Jacobians of genus 2 hyperelliptic curves over finite fields

This paper deals with fields of definition of the l-torsion points on the Jacobians of genus 2 hyperelliptic curves over finite fields in order to speed Gaudry and Schost’s point counting algorithm for genus 2 hyperelliptic curves up. A result in this paper shows that the extension degrees of the fields of difinition of the l-torsion points can be in O(l) instead of O(l). The effects of the res...

متن کامل

The Euler Characteristic of Local Systems on the Moduli of Genus 3 Hyperelliptic Curves

For a partition λ = {λ1 ≥ λ2 ≥ λ3 ≥ 0} of non-negative integers, we calculate the Euler characteristic of the local system Vλ on the moduli space of genus 3 hyperelliptic curves using a suitable stratification. For some λ of low degree, we make a guess for the motivic Euler characteristic of Vλ using counting curves over finite fields.

متن کامل

Computing L-Series of Hyperelliptic Curves

We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.

متن کامل

An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves

We present an algorithm for counting points on superelliptic curves y = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorithm for hyperelliptic curves due to Kedlaya. In this extension, the complexity, assuming r and the genus are fixed, is O(log q) in time and space, just like for hyperelliptic curves. We give some numerical examples obtaine...

متن کامل

Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves

We describe the use of explicit isogenies to reduce Discrete Logarithm Problems (DLPs) on Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, which are vulnerable to faster index calculus attacks. We provide algorithms which compute an isogeny with kernel isomorphic to (Z/2Z) for any hyperelliptic genus 3 curve. These algorithms provide a rational isogeny...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004